Forbidden Configurations: Finding the number predicted by the Anstee-Sali Conjecture is NP-hard
نویسنده
چکیده
Let F be a hypergraph and let forb(m,F ) denote the maximum number of edges a hypergraph with m vertices can have if it doesn’t contain F as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of forb(m,F ) for fixed F . In this paper we prove that even finding this predicted asymptotic behaviour is an NP-hard problem, meaning that if the Anstee-Sali conjecture were true, finding the asymptotics of forb(m,F ) would be NP-hard. Mathematics Subject Classification: 05D05
منابع مشابه
Pairwise intersections and forbidden configurations
By symmetry we can assume a ≥ d and b ≥ c. We show that fm(a, b, c, d) isΘ(ma+b−1) if either b > c or a, b ≥ 1. We also show that fm(0, b, b, 0) is Θ(m) and fm(a, 0, 0, d) is Θ(m). This can be viewed as a result concerning forbidden configurations and is further evidence for a conjecture of Anstee and Sali. Our key tool is a strong stability version of the Complete Intersection Theorem of Ahlsw...
متن کاملSmall Forbidden Configurations II
The present paper continues the work begun by Anstee, Griggs and Sali on small forbidden configurations. In the notation of (0,1)-matrices, we consider a (0,1)-matrix F (the forbidden configuration), an m × n (0,1)-matrix A with no repeated columns which has no submatrix which is a row and column permutation of F , and seek bounds on n in terms of m and F . We give new exact bounds for some 2× ...
متن کاملA Survey of Forbidden Configuration Results (Draft)
This paper surveys various results concerning the problem of forbidden configurations (also known as trace in the language of set systems). Let F be a k × ` (0,1)-matrix (the forbidden configuration). We define a matrix to be simple if it is a (0,1)-matrix with no repeated columns. The matrix F need not be simple. We define forb(m,F ) as the maximum number of columns of any simple m-rowed matri...
متن کاملEvidence for a forbidden configuration conjecture: One more case solved
A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)matrix F , we define that a (0,1)-matrix A has no F as a configuration if there is no submatrix of A which is a row and column permutation of F . Let |A| denote the number of columns of A. We define forb(m,F ) = max{|A| : A is an m-rowed simple matrix and with no configuration F}. For two matrices H,K we define [H |K] as the...
متن کاملLarge Forbidden Configurations and Design Theory
Let forb(m,F ) denote the maximum number of columns possible in a (0,1)matrix A that has no repeated columns and has no submatrix which is a row and column permutation of F . We consider cases where the configuration F has a number of columns that grows with m. For a k× ` matrix G, define s ·G to be the concatenation of s copies of G. In a number of cases we determine forb(m,mα ·G) is Θ(mk+α). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.8189 شماره
صفحات -
تاریخ انتشار 2012